.. as a replacement for _gtk_rbtree_node_find_parity(). Instead of 1 or
0, the function now returns the index of node in the complete tree
(counting from the root). And this is of course identical to the row
number.
return retval;
}
-gint
-_gtk_rbtree_node_find_parity (GtkRBTree *tree,
- GtkRBNode *node)
+guint
+_gtk_rbtree_node_get_index (GtkRBTree *tree,
+ GtkRBNode *node)
{
GtkRBNode *last;
- gint retval;
+ guint retval;
g_assert (node);
g_assert (node->left);
}
}
- return retval % 2;
+ return retval;
}
gint
gboolean mark_valid);
gint _gtk_rbtree_node_find_offset (GtkRBTree *tree,
GtkRBNode *node);
-gint _gtk_rbtree_node_find_parity (GtkRBTree *tree,
+guint _gtk_rbtree_node_get_index (GtkRBTree *tree,
GtkRBNode *node);
gboolean _gtk_rbtree_find_index (GtkRBTree *tree,
guint index,
* order, drawing each successive node.
*/
- parity = !_gtk_rbtree_node_find_parity (tree, node);
+ parity = !(_gtk_rbtree_node_get_index (tree, node) % 2);
do
{
{
GtkRegionFlags row_flags;
- if (_gtk_rbtree_node_find_parity (tree, node))
+ if ((_gtk_rbtree_node_get_index (tree, node) % 2))
row_flags = GTK_REGION_ODD;
else
row_flags = GTK_REGION_EVEN;